Accuracy Threshold for Quantum Computation
نویسنده
چکیده
We have previously 11] shown that for quantum memories and quantum communication, a state can be transmitted over arbitrary distances with error provided each gate has error at most cc. We discuss a similar concatenation technique which can be used with fault tolerant networks to achieve any desired accuracy when computing with classical initial states, provided a minimum gate accuracy can be achieved. The technique works under realistic assumptions on operational errors. These assumptions are more general than the stochastic error heuristic used in other work. Methods are proposed to account for leakage errors, a problem not previously recognized.
منابع مشابه
Accuracy threshold for postselected quantum computation
We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The proof applies to independent stochast...
متن کاملSimple proof of fault tolerance in the graph-state model
We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by invoking the threshold theorem derived for quantum circuit computation. Lower bounds for the threshold in the graph-state model are then obtained from known boun...
متن کاملFault-tolerant quantum computation against biased noise
We formulate a scheme for fault-tolerant quantum computation that works effectively against highly biased noise, where dephasing is far stronger than all other types of noise. In our scheme, the fundamental operations performed by the quantum computer are single-qubit preparations, single-qubit measurements, and conditionalphase CPHASE gates, where the noise in the CPHASE gates is biased. We sh...
متن کاملQuantum accuracy threshold for concatenated distance-3 codes
We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold ε0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criter...
متن کاملFault-tolerant Computation without Concatenation
It has been known that error-correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold (probably ∼ 10–10). Other, un-concatenated codes with their own attractive features—e.g., an accuracy threshold ∼ 10—have also been studied. A method to obtain universal computation is presented here which do...
متن کاملLevel Reduction and the Quantum Threshold Theorem
Computers have led society to the information age revolutionizing central aspects of our lives from production and communication to education and entertainment. There exist, however, important problems which are intractable with the computers available today and, experience teaches us, will remain so even with the more advanced computers we can envision for tomorrow. Quantum computers promise s...
متن کامل